Regular subgraphs of random graphs
نویسندگان
چکیده
In this paper, we prove that there exists a function ρk = (4 + o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ > ρk. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. We also discuss the appearance of 3-regular subgraphs in cores of random graphs.
منابع مشابه
Regular pairs in sparse random graphs I
We consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs.
متن کامل3-star Factors in Random D-regular Graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been used to study the almost sure existence of, and the asymptotic distribution of, regular spanning subgraphs of various types in random d-regular graphs and hypergraphs. In this paper, we use the method to prove the almos...
متن کاملModels of random regular graphs
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are also presented, as well as various generalisations to random graphs with given degree sequence. A major feature in this area is the small subgraph conditioning method. When applicable, this establish...
متن کاملThe Regularity Lemma of Szemerédi for Sparse Graphs
In this note we present a new version of the well-known lemma of Szemerédi [17] concerning regular partitions of graphs. Our result deals with subgraphs of pseudo-random graphs, and hence may be used to partition sparse graphs that do no contain dense subgraphs.
متن کاملConnected Balanced Subgraphs in Random Regular Multigraphs Under the Configuration Model∗
Our previous paper [9] applied a lopsided version of the Lovász Local Lemma that allows negative dependency graphs [5] to the space of random matchings in K2n, deriving new proofs to a number of results on the enumeration of regular graphs with excluded cycles through the configuration model [3]. Here we extend this from excluded cycles to some excluded balanced subgraphs, and derive asymptotic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 29 شماره
صفحات -
تاریخ انتشار 2006